Loose Graph Simulations
نویسندگان
چکیده
We introduce loose graph simulations (LGS), a new notion about labelled graphs which subsumes in an intuitive and natural way subgraph isomorphism (SGI), regular language pattern matching (RLPM) and graph simulation (GS). Being an unification of all these notions, LGS allows us to express directly also problems which are “mixed” instances of previous ones, and hence which would not fit easily in any of them. After the definition and some examples, we show that the problem of finding loose graph simulations is NP-complete, we provide formal translation of SGI, RLPM, and GS into LGSs, and we give the representation of a problem which extends both SGI and RLPM.
منابع مشابه
Static and Dynamic Analyses of Micropiles to Reinforce the High Railway Embankments on Loose Beds
Construction of railway embankments on loose beds without using any methods of soil improvement (e.g. stone columns in silt and clay beds, deep soil mixing method, jet grouting and also using micropiles individually or in groups form) leads to reduction of embankment slope gradient, which significantly increases the volume of soil operation. Generally, micropile as a reinforcing element with t...
متن کاملLoose Semantics and Constraints for GraphTransformation Systems ?
The main aim of this paper is an extension of the theory of algebraic graph transformation systems by a loose semantics. For this purpose, graph transitions are introduced as a loose interpretation of graph productions. They are deened using a double pullback construction in contrast to classical graph derivations based on double-pushouts. Two characterisation results relate graph transitions t...
متن کاملGalaxies.
We have determined the mass function of loose groups of galaxies in the Las Campanas Redshift Survey. Loose groups of galaxies in the LCRS range in mass from M ∼ 10 12 M ⊙ to 10 15 M ⊙. We find that the sample is complete for masses in the interval 8 · 10 13 − 8 · 10 14 M ⊙. In this interval the mass function of LCRS loose groups is close to that found by Girardi et al. (1998). Comparison of th...
متن کاملMonochromatic Loose-cycle Partitions in Hypergraphs
In this paper we study the monochromatic loose-cycle partition problem for non-complete hypergraphs. Our main result is that in any r-coloring of a k-uniform hypergraph with independence number α there is a partition of the vertex set into monochromatic loose cycles such that their number depends only on r, k and α. We also give an extension of the following result of Pósa to hypergraphs: the v...
متن کاملJamming III: Characterizing randomness via the entropy of jammed matter
The nature of randomness in disordered packings of frictional and frictionless spheres is investigated using theory and simulations of identical spherical grains. The entropy of the packings is defined through the force and volume ensemble of jammed matter and this is shown to be difficult to calculate analytically. A mesoscopic ensemble of isostatic states is then utilized in an effort to pred...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017